Multi-objective Combinatorial Optimization: Beyond the Biobjective Case
نویسندگان
چکیده
09:30 Tristan Cazenave, Marek Cornu, Daniel Vanderpooten A two-phase meta-heuristic applied to the Multi-objective Traveling Salesman Problem Recently, a number of hybrid meta-heuristics have been successfully applied on different problems like the MO Traveling Salesman Problem (TSP), the MO Multidimensional Knapsack Problem and the MO Flow-shop Scheduling Problem. We present a method providing a general two-phase framework for finding an approximation of the non-dominated set. The first phase approximates the supported non-dominated set. A new approach is proposed to explore the weight space when the number of objectives is greater than two. The second phase combines scalarization-based and MO local search techniques to refine the non-dominated set. The method is compared to state-of-the-art algorithms on bi-objective and tri-objective TSP instances
منابع مشابه
Choquet optimal set in biobjective combinatorial optimization
We study in this paper the generation of the Choquet optimal solutions of biobjective combinatorial optimization problems. Choquet optimal solutions are solutions that optimize a Choquet integral. The Choquet integral is used as an aggregation function, presenting di erent parameters, and allowing to take into account the interactions between the objectives. We develop a new property that chara...
متن کاملUsing Bound Sets in Multiobjective Optimization: Application to the Biobjective Binary Knapsack Problem
This paper is devoted to a study of the impact of using bound sets in biobjective optimization. This notion, introduced by Villareal and Karwan [19], has been independently revisited by Ehrgott and Gandibleux [9], as well as by Sourd and Spanjaard [17]. The idea behind it is very general, and can therefore be adapted to a wide range of biobjective combinatorial problem. We focus here on the bio...
متن کاملA M C M Representation of the Non-dominated Set in Biobjective Combinatorial Optimization Representation of the Non-dominated Set in Biobjective Combinatorial Optimization
This article introduces several algorithms for finding a representative subset of the non-dominated point set of a biobjective combinatorial optimization problem with respect to uniformity, coverage and the -indicator. These representation problems are formulated as particular facility location problems with a special location structure, which allows for polynomial-time algorithms in the biobje...
متن کاملAn optimization technique for vendor selection with quantity discounts using Genetic Algorithm
Vendor selection decisions are complicated by the fact that various conflicting multi-objective factors must be considered in the decision making process. The problem of vendor selection becomes still more compli-cated with the inclusion of incremental discount pricing schedule. Such hard combinatorial problems when solved using meta heuristics produce near optimal solutions. This paper propose...
متن کاملOn the sensitivity of aggregative multiobjective optimization methods
In this paper, we present a study on the sensitivity of aggregation methods with respect to the weights associated with objective functions of a multiobjective optimization problem. To do this study, we have developped some measurements such as the speed metric or the distribution metric. We have performed this study on a set of biobjective optimization test problems: a convex, a non-convex, a ...
متن کامل